Applying a uniform marked morphism to a word y Anna Frid
نویسنده
چکیده
We describe the relationship between different parameters of the initial word and its image obtained by application of a uniform marked morphism. The functions described include the subword complexity, frequency of factors, and the recurrence function. The relations obtained for the image of a word can be used also for the image of a factorial language. Using induction, we give a full description of the involved functions of the fixed point of the morphism considered.
منابع مشابه
Applying a uniform marked morphism to a word
We describe the relationship between different parameters of the initial word and its image obtained by application of a uniform marked morphism. The functions described include the subword complexity, frequency of factors, and the recurrence function. The relations obtained for the image of a word can be used also for the image of a factorial language. Using induction, we give a full descripti...
متن کاملOn Uniform DOL Words
We introduce the wide class of marked uniform DOL words and study their structure. The criterium of circularity of a marked uniform DOL word is given, and the subword complexity function is found for the uncircular case as well as for the circular one. The same technique is valid for a wider class of uniform DOL sequences which includes (p; 1)-Toeplitz words (see 4]).
متن کاملOn the Frequency of Factors in a D0L Word
We study the frequency of factors in a D0L word on an alphabet , which is known to constitute a probability measure on the set of all sequences on. For the general case, we obtain a recurrence formula describing the frequency of a given word. Then we use this formula to give a precise description of the frequencies of factors in a circular marked uniform D0L word.
متن کاملOverlap - Free Symmetric D 0 L words † Anna
It was rediscovered several times, can be constructed in many alternative ways and occurs in various fields of mathematics (see the survey [1]). The set of all overlap-free words was studied e. g. by E. D. Fife [8] who described all binary overlapfree infinite words and P. Séébold [13] who proved that the Thue-Morse word is essentially the only binary overlap-free word which is a fixed point of...
متن کاملOverlap-free symmetric D0L words
It was rediscovered several times, can be constructed in many alternative ways and occurs in various fields of mathematics (see the survey [1]). The set of all overlap-free words was studied e. g. by Fife [8] who described all binary overlap-free infinite words and Séébold [13] who proved that the Thue-Morse word is essentially the only binary overlap-free word which is a fixed point of a morph...
متن کامل